Resolution in Linguistic Propositional Logic based on Linear Symmetrical Hedge Algebra

The paper introduces a propositional linguistic logic that serves as the basis for automated uncertain reasoning with linguistic information. First, we build a linguistic logic system with truth value domain based on a linear symmetrical hedge algebra. Then, we consider G\"{o}del's t-norm and t-conorm to define the logical connectives for our logic. Next, we present a resolution inference rule, in which two clauses having contradictory linguistic truth values can be resolved. We also give the concept of reliability in order to capture the approximative nature of the resolution inference rule. Finally, we propose a resolution procedure with the maximal reliability.Comment: KSE 2013 conferenc

Stable Models of Fuzzy Propositional Formulas

Abstract. We introduce the stable model semantics for fuzzy propositional for-mulas, which generalizes both fuzzy propositional logic and the stable model se-mantics of Boolean propositional formulas. Combining the advantages of both for-malisms, the introduced language allows highly configurable default reasoning in-volving fuzzy truth values. We show that several properties of Boolean stable mod-els are naturally extended to this formalism, and discuss how it is related to other approaches to combining fuzzy logic and the stable model semantics.

From fuzzy to annotated semantic web languages

The aim of this chapter is to present a detailed, selfcontained and comprehensive account of the state of the art in representing and reasoning with fuzzy knowledge in Semantic Web Languages such as triple languages RDF/RDFS, conceptual languages of the OWL 2 family and rule languages. We further show how one may generalise them to so-called annotation domains, that cover also e.g. temporal and provenance extensions

A unique decomposition theorem for ordered monoids with applications in process theory

We prove a unique decomposition theorem for a class of ordered commutative monoids. Then, we use our theorem to establish that every weakly normed process definable in ACP \mathalphae with bounded communication can be expressed as the parallel composition of a multiset of weakly normed parallel prime processes in exactly one way

A faster FPT algorithm for max-leaf spanning trees

We describe a new, fast, and fairly simple FPT algorithm for the problem of deciding whether a given input graph G has a spanning tree with at least k leaves. The time complexity of our algorithm is polynomially bounded in the size of G, and its dependence on k is roughly O(9.49 k ). This is the fastest currently known algorithm for this problem

Fair maid of Perth [music] : waltz /

Catalogue record generated as part of a batch load.; "Dedicated to Miss Margaret Brockman (Mrs P. A. Hare) of Moonda Western Australia".; Copy of cover may come from different edition from the music.; Handwritten note states "Sir Thomas Cockburn was Editor of the "West Australian" in Perth".; Also available online http://nla.gov.au/nla.mus-vn5715829

Placental transfer of antibodies to streptococcus pneumoniae in immunized pregnant, according to nutritional state

Objetivo: Estudar o transporte transplacentario de IgG ao Streptococcus pneumoniae (sorotipos 1, 3, 5, 613, 9V e 14) em gestantes imunizadas com vacina polissacaridica 23-valente. Metodos: Estudamos 20 pares de maes nutridas e desnutridas com seus respectivos recem-nascidos. As concentracoes de IgG especifica ao pneumococo foram determinados pela tecnica de ELISA. O criterio considerado como producao de Anticorpos adequada a cada sorotipo foi: pos-vacinai > 1,3gg/ml elou incrementos (pos/pre) > 4 vezes. Resultados: A analise estatistica comparativa das concentracoes pre-vacinais de IgG especifica para cada sorotipos (1, 3, 5, 6V, 913 e 14) testados entre os grupos, revelou valores com significancia aos sorotipos PS1 e PS5 (p< 0,005), verificou-se que as concentracoes foram maiores nos grupos das maes desnutridas. Houve um aumento das medias geometricas das concentracoes pos-vacinais, para todos os sorotipos testados dentro de cada grupo, predominando nos grupos das desnutridas. A resposta ao sorotipo PS3 foi menor, e maior frequencia de resposta ao sorotipo PS14 nos dois grupos, embora nao seja estatisticamente significante. Os niveis destes Acs especificos foram inferiores nos RNs do que aqueles detectados nas suas maes. Estes niveis de Acs nos RNs foram significativamente influenciados pela concentracao materna de Acs ao PS1, PS6 e PS9 (p< 0,05). Correlacao foi positiva e significativa (0,6 < ( r 1 < 1) entre os titulos de Acs maternos e RN no grupo das maes nutridas e foi detectado uma correlacao negativa ao sorotipo PS14 e PS5 nos grupos das desnutridas. O maior incremento na concentracao de anticorpos nas amostras pos, em relacao as pre-vacinais foi observado no grupo das maes desnutridas (p< 0,005) para os PS1, PS9V. Segundo o criterio de concentracao de IgG ? 1,3 gg/ml verificou-se diferenca na percentagem da concentracao de IgG entre os RNs aos sorotipos PS1, PS3, PS5, PS6B e PS9V (p< 0,005) de 1,3 gg/ml nos grupos das desnutridas. Conclusoes: Concluimos que, a vacina polissacaridica antipneumococica 23-valente induziu producao de IgG a todos os sorotipos (PS) do pneumococo nos dois grupos. resultando em passagem transplacentaria destes anticorpos para os RNs com provavel protecao proporcionando titulos mais altos no nascimento. O estado nutricional nao interferiu na passagem destes anticorposBV UNIFESP: Teses e dissertaçõe

Monotonic and Residuated Logic Programs

In this paper we define the rather general framework of Monotonic Logic Programs, where the main results of (definite) logic programming are validly extrapolated. Whenever defining new logic programming extensions, we can thus turn our attention to the stipulation and study of its intuitive algebraic properties within the very general setting. Then, the existence of a minimum model and of a monotonic immediate consequences operator is guaranteed, and they are related as in classical logic programming. Afterwards we study the more restricted class of residuated logic programs which is able to capture several quite distinct logic programming semantics. Namely: Generalized Annotated Logic Programs, Fuzzy Logic Programming, Hybrid Probabilistic Logic Programs, and Possibilistic Logic Programming. We provide the embedding of possibilistic logic programming